On balanced 4-holes in bichromatic point sets

نویسندگان

  • Sergey Bereg
  • José Miguel Díaz-Báñez
  • Ruy Fabila Monroy
  • Pablo Pérez-Lantero
  • A. Ramírez-Vigueras
  • Toshinori Sakai
  • Jorge Urrutia
  • Inmaculada Ventura
چکیده

Let S = R∪B be a set of n points in general position in the plane. The elements of R and B will be called, respectively, the red and blue elements of S. A k-hole of S is a simple polygon with k vertices, all in S, and containing no element of S in its interior. A 4-hole of S is balanced if it has two blue and two red vertices. In this paper, we characterize the set of bicolored points S = R∪B that have balanced convex 4-holes. We also show that if the 4-holes of S are allowed to be nonconvex, and |R| = |B|, then S always has a quadratic number of balanced 4-holes. The study of k-holes in colored point sets was introduced by Devillers et al. [2]. They obtained a bichromatic point set S = R ∪B with 18 points that contains no convex monochromatic 4-hole. Recently, Hummer and Seara obtained a bichromatic point set with 36 points that does not contain monochromatic 4-holes [3]. This result was improved by Koshelev [4] to 46. Devillers et al. [2] also proved that every 2colored Horton set with at least 64 elements contains an empty monochromatic 4-hole. In the same paper the following conjecture is posed: Every sufficiently large bichromatic point set contains a monochromatic convex 4-hole. This conjecture remains open. On the other hand, Aichholzer et al [1] proved that any sufficiently large bichromatic point set always contains a not necessarily convex monochromatic 4-hole.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Point-Set Embeddability of 2-Colored Trees

In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings of trees (whose vertices are colored red and blue) on point sets (whose points are colored red and blue) such that each red (blue) vertex is mapped to a red (resp. blue) point. We prove that deciding whether a given 2-colored tree admits a bichromatic point-set embeddin...

متن کامل

Optimal random matchings, tours, and spanning trees in hierarchically separated trees

We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size n distributed among the leaves of a balanced hierarchically separated tree. We consider monochromatic and bichromatic versions of the minimum matching, minimum spanning tree, and traveling salesman problems. We also present tight concentration results for the monochromatic...

متن کامل

Quasi - Parallel Segments and Characterization of 1 Unique Bichromatic Matchings

5 Given n red and n blue points in general position in the plane, it is well-known 6 that there is a perfect matching formed by non-crossing line segments. We charac-7 terize the bichromatic point sets which admit exactly one non-crossing matching. 8 We give several geometric descriptions of such sets, and find an O(n log n) algorithm 9 that checks whether a given bichromatic set has this prope...

متن کامل

Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings

Given n red and n blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing matching. We give several geometric descriptions of such sets, and find an O(n log n) algorithm that checks whether a given bichromatic set has this property.

متن کامل

Reporting Bichromatic Segment Intersections from Point Sets

In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red and blue, we present an O(n) time and space algorithm for solving the problem of reporting the set of segments of each color intersected by segments of the other color. We al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Geom.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2015